Convex Nonparanormal Regression

نویسندگان

چکیده

Quantifying uncertainty in predictions or, more generally, estimating the posterior conditional distribution, is a core challenge machine learning and statistics. We introduce Convex Nonparanormal Regression (CNR), nonparanormal approach for coping with this task. CNR involves convex optimization of defined via rich dictionary pre-defined non linear transformations on Gaussians. It can fit an arbitrary including multimodal non-symmetric posteriors. For special but powerful case piecewise dictionary, we provide closed form mean which be used point-wise predictions. Finally, demonstrate advantages over classical competitors using synthetic real world data.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonparanormal Information Estimation

We study the problem of using i.i.d. samples from an unknown multivariate probability distribution p to estimate the mutual information of p. This problem has recently received attention in two settings: (1) where p is assumed to be Gaussian and (2) where p is assumed only to lie in a large nonparametric smoothness class. Estimators proposed for the Gaussian case converge in high dimensions whe...

متن کامل

Nonparanormal Belief Propagation (NPNBP)

The empirical success of the belief propagation approximate inference algorithm has inspired numerous theoretical and algorithmic advances. Yet, for continuous non-Gaussian domains performing belief propagation remains a challenging task: recent innovations such as nonparametric or kernel belief propagation, while useful, come with a substantial computational cost and offer little theoretical g...

متن کامل

Convex Factorization Machine for Regression

We propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the l2-regularizer and the quadratic term with the trace norm regularizer. Then, we formulate the CFM optimization as a semidefinite programming problem and propose an efficient optimiza...

متن کامل

Active Learning for Convex Regression

In this paper, we introduce the first principled adaptive-sampling procedure for learning a convex function in the L∞ norm, a problem that arises often in economics, psychology, and the social sciences. We present a function-specific measure of complexity and use it to prove that our algorithm is informationtheoretically near-optimal in a strong, function-specific sense. We also corroborate our...

متن کامل

Consistency of Multidimensional Convex Regression

Convex regression is concerned with computing the best fit of a convex function to a data set of n observations in which the independent variable is (possibly) multi–dimensional. Such regression problems arise in operations research, economics, and other disciplines in which imposing a convexity constraint on the regression function is natural. This paper studies a least squares estimator that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Signal Processing Letters

سال: 2021

ISSN: ['1558-2361', '1070-9908']

DOI: https://doi.org/10.1109/lsp.2021.3102849